Cone characterizations of approximate solutions in real-vector optimization
نویسندگان
چکیده
Borrowing concepts from linear algebra and convex analysis, it has been shown how the feasible set for a general vector optimization problem can be mapped under a linear transformation so that Pareto points in the image correspond to nondominated solutions for the original problem. The focus of this paper is to establish corresponding results for approximate nondominated points, based on a new characterization of these solutions using the concept of translated cones. The problem of optimizing over this set of approximate solutions is addressed and possible applications are given in the references.
منابع مشابه
Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملOptimality Conditions for Approximate Solutions in Multiobjective Optimization Problems
We study firstand second-order necessary and sufficient optimality conditions for approximate weakly, properly efficient solutions of multiobjective optimization problems. Here, tangent cone, -normal cone, cones of feasible directions, second-order tangent set, asymptotic second-order cone, and Hadamard upper lower directional derivatives are used in the characterizations. The results are first...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملSequential Characterization of Solutions in Convex Composite Programming and Applications to Vector Optimization
When characterizing optimal solutions of both scalar and vector optimization problems usually constraint qualifications have to be satisfied. By considering sequential characterizations, given for the first time in vector optimization in this paper, this drawback is eliminated. In order to establish them we give first of all sequential characterizations for a convex composed optimization proble...
متن کاملFarkas-Type Results for Vector-Valued Functions with Applications
The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space de ned by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005